Convex and non-convex regularization methods for spatial point processes intensity estimation
نویسندگان
چکیده
منابع مشابه
Non-convex Sparse Regularization
We study the regularising properties of Tikhonov regularisation on the sequence space l with weighted, non-quadratic penalty term acting separately on the coefficients of a given sequence. We derive sufficient conditions for the penalty term that guarantee the well-posedness of the method, and investigate to which extent the same conditions are also necessary. A particular interest of this pape...
متن کاملRegularized bundle methods for convex and non-convex risks
Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may sometimes be inappropriate to look for convexity at any price. Alternatively one can decide not to limit a priori the modeling expressivity ...
متن کاملBayesian semiparametric intensity estimation for inhomogeneous spatial point processes.
In this work we propose a fully Bayesian semiparametric method to estimate the intensity of an inhomogeneous spatial point process. The basic idea is to first convert intensity estimation into a Poisson regression setting via binning data points on a regular grid, and then model the log intensity semiparametrically using an adaptive version of Gaussian Markov random fields to smooth the corresp...
متن کاملOn the behavior of Lagrange multipliers in convex and non-convex infeasible interior point methods∗
This paper analyzes sequences generated by infeasible interior point methods. In convex and nonconvex settings, we prove that moving the primal feasibility at the same rate as complementarity will ensure that the Lagrange multiplier sequence will remain bounded, provided the limit point of the primal sequence has a Lagrange multiplier, without constraint qualification assumptions. We also show ...
متن کاملRegularization With Non-convex Separable Constraints
We consider regularization of nonlinear ill-posed problems with constraints which are non-convex. As a special case we consider separable constraints, i.e. the regularization takes place in a sequence space and the constraint acts on each sequence element with a possibly non-convex function. We derive conditions under which such a constraint provides a regularization. Moreover, we derive estima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2018
ISSN: 1935-7524
DOI: 10.1214/18-ejs1408